#define _CRT_SECURE_NO_WARNINGS 1

//https://leetcode.cn/problems/evaluate-boolean-binary-tree/

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        return dfs(root);
    }

    bool dfs(TreeNode* root)
    {
        if (root->left == nullptr && root->right == nullptr) return root->val;

        int left = dfs(root->left);
        int right = dfs(root->right);
        if (root->val == 2) return left | right;
        return left & right;
    }
};